Termination w.r.t. Q proof of TRS/TRCSRExIntrod_GM99

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(head₁(X)) -> PROPER₁(X)
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> DIVIDES₂(s₁(s₁(X)), Y)
ACTIVE₁(if₃(X1, X2, X3)) -> IF₃(active₁(X1), X2, X3)
PROPER₁(divides₂(X1, X2)) -> DIVIDES₂(proper₁(X1), proper₁(X2))
ACTIVE₁(sieve₁(cons₂(X, Y))) -> CONS₂(X, filter₂(X, sieve₁(Y)))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(tail₁(X)) -> TAIL₁(active₁(X))
IF₃(mark₁(X1), X2, X3) -> IF₃(X1, X2, X3)
HEAD₁(mark₁(X)) -> HEAD₁(X)
ACTIVE₁(filter₂(X1, X2)) -> FILTER₂(active₁(X1), X2)
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> DIVIDES₂(X1, active₁(X2))
PROPER₁(tail₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(tail₁(X)) -> TAIL₁(proper₁(X))
ACTIVE₁(primes) -> S₁(s₁(0))
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> SIEVE₁(Y)
ACTIVE₁(divides₂(X1, X2)) -> DIVIDES₂(active₁(X1), X2)
DIVIDES₂(mark₁(X1), X2) -> DIVIDES₂(X1, X2)
ACTIVE₁(primes) -> S₁(0)
HEAD₁(ok₁(X)) -> HEAD₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)
ACTIVE₁(sieve₁(X)) -> SIEVE₁(active₁(X))
TOP₁(mark₁(X)) -> PROPER₁(X)
FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)
TAIL₁(ok₁(X)) -> TAIL₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> CONS₂(Y, filter₂(X, sieve₁(Y)))
ACTIVE₁(primes) -> SIEVE₁(from₁(s₁(s₁(0))))
DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)
IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)
ACTIVE₁(sieve₁(cons₂(X, Y))) -> SIEVE₁(Y)
ACTIVE₁(head₁(X)) -> ACTIVE₁(X)
PROPER₁(if₃(X1, X2, X3)) -> IF₃(proper₁(X1), proper₁(X2), proper₁(X3))
PROPER₁(sieve₁(X)) -> SIEVE₁(proper₁(X))
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(filter₂(X1, X2)) -> FILTER₂(proper₁(X1), proper₁(X2))
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(head₁(X)) -> HEAD₁(active₁(X))
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
SIEVE₁(ok₁(X)) -> SIEVE₁(X)
ACTIVE₁(filter₂(X1, X2)) -> FILTER₂(X1, active₁(X2))
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> IF₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y))))
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
TAIL₁(mark₁(X)) -> TAIL₁(X)
PROPER₁(head₁(X)) -> HEAD₁(proper₁(X))
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
SIEVE₁(mark₁(X)) -> SIEVE₁(X)
FILTER₂(ok₁(X1), ok₁(X2)) -> FILTER₂(X1, X2)
ACTIVE₁(sieve₁(X)) -> ACTIVE₁(X)
ACTIVE₁(sieve₁(cons₂(X, Y))) -> FILTER₂(X, sieve₁(Y))
ACTIVE₁(from₁(X)) -> S₁(X)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> FILTER₂(s₁(s₁(X)), Z)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> FILTER₂(X, sieve₁(Y))
FROM₁(ok₁(X)) -> FROM₁(X)
ACTIVE₁(primes) -> FROM₁(s₁(s₁(0)))

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(head₁(X)) -> PROPER₁(X)
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> DIVIDES₂(s₁(s₁(X)), Y)
ACTIVE₁(if₃(X1, X2, X3)) -> IF₃(active₁(X1), X2, X3)
PROPER₁(divides₂(X1, X2)) -> DIVIDES₂(proper₁(X1), proper₁(X2))
ACTIVE₁(sieve₁(cons₂(X, Y))) -> CONS₂(X, filter₂(X, sieve₁(Y)))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(tail₁(X)) -> TAIL₁(active₁(X))
IF₃(mark₁(X1), X2, X3) -> IF₃(X1, X2, X3)
HEAD₁(mark₁(X)) -> HEAD₁(X)
ACTIVE₁(filter₂(X1, X2)) -> FILTER₂(active₁(X1), X2)
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> DIVIDES₂(X1, active₁(X2))
PROPER₁(tail₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(tail₁(X)) -> TAIL₁(proper₁(X))
ACTIVE₁(primes) -> S₁(s₁(0))
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> SIEVE₁(Y)
ACTIVE₁(divides₂(X1, X2)) -> DIVIDES₂(active₁(X1), X2)
DIVIDES₂(mark₁(X1), X2) -> DIVIDES₂(X1, X2)
ACTIVE₁(primes) -> S₁(0)
HEAD₁(ok₁(X)) -> HEAD₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)
ACTIVE₁(sieve₁(X)) -> SIEVE₁(active₁(X))
TOP₁(mark₁(X)) -> PROPER₁(X)
FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)
TAIL₁(ok₁(X)) -> TAIL₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> CONS₂(Y, filter₂(X, sieve₁(Y)))
ACTIVE₁(primes) -> SIEVE₁(from₁(s₁(s₁(0))))
DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)
IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)
ACTIVE₁(sieve₁(cons₂(X, Y))) -> SIEVE₁(Y)
ACTIVE₁(head₁(X)) -> ACTIVE₁(X)
PROPER₁(if₃(X1, X2, X3)) -> IF₃(proper₁(X1), proper₁(X2), proper₁(X3))
PROPER₁(sieve₁(X)) -> SIEVE₁(proper₁(X))
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(filter₂(X1, X2)) -> FILTER₂(proper₁(X1), proper₁(X2))
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(head₁(X)) -> HEAD₁(active₁(X))
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
SIEVE₁(ok₁(X)) -> SIEVE₁(X)
ACTIVE₁(filter₂(X1, X2)) -> FILTER₂(X1, active₁(X2))
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> IF₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y))))
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
TAIL₁(mark₁(X)) -> TAIL₁(X)
PROPER₁(head₁(X)) -> HEAD₁(proper₁(X))
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
SIEVE₁(mark₁(X)) -> SIEVE₁(X)
FILTER₂(ok₁(X1), ok₁(X2)) -> FILTER₂(X1, X2)
ACTIVE₁(sieve₁(X)) -> ACTIVE₁(X)
ACTIVE₁(sieve₁(cons₂(X, Y))) -> FILTER₂(X, sieve₁(Y))
ACTIVE₁(from₁(X)) -> S₁(X)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> FILTER₂(s₁(s₁(X)), Z)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> FILTER₂(X, sieve₁(Y))
FROM₁(ok₁(X)) -> FROM₁(X)
ACTIVE₁(primes) -> FROM₁(s₁(s₁(0)))

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 12 SCCs with 38 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIVIDES₂(mark₁(X1), X2) -> DIVIDES₂(X1, X2)
DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)
DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DIVIDES₂(mark₁(X1), X2) -> DIVIDES₂(X1, X2)

The remaining pairs can at least be oriented weakly.

DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)
DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( DIVIDES₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)
DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DIVIDES₂(X1, mark₁(X2)) -> DIVIDES₂(X1, X2)

The remaining pairs can at least be oriented weakly.

DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( DIVIDES₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DIVIDES₂(ok₁(X1), ok₁(X2)) -> DIVIDES₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( DIVIDES₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FILTER₂(ok₁(X1), ok₁(X2)) -> FILTER₂(X1, X2)
FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)
FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FILTER₂(ok₁(X1), ok₁(X2)) -> FILTER₂(X1, X2)

The remaining pairs can at least be oriented weakly.

FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)
FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FILTER₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

POL( mark₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)
FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FILTER₂(mark₁(X1), X2) -> FILTER₂(X1, X2)

The remaining pairs can at least be oriented weakly.

FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FILTER₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FILTER₂(X1, mark₁(X2)) -> FILTER₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FILTER₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF₃(mark₁(X1), X2, X3) -> IF₃(X1, X2, X3)
IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

IF₃(mark₁(X1), X2, X3) -> IF₃(X1, X2, X3)

The remaining pairs can at least be oriented weakly.

IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( IF₃(x₁, ..., x₃) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

IF₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> IF₃(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( IF₃(x₁, ..., x₃) ) = max{0, x₃ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TAIL₁(mark₁(X)) -> TAIL₁(X)
TAIL₁(ok₁(X)) -> TAIL₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

TAIL₁(mark₁(X)) -> TAIL₁(X)

The remaining pairs can at least be oriented weakly.

TAIL₁(ok₁(X)) -> TAIL₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( TAIL₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TAIL₁(ok₁(X)) -> TAIL₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

TAIL₁(ok₁(X)) -> TAIL₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( TAIL₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

HEAD₁(ok₁(X)) -> HEAD₁(X)
HEAD₁(mark₁(X)) -> HEAD₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

HEAD₁(ok₁(X)) -> HEAD₁(X)

The remaining pairs can at least be oriented weakly.

HEAD₁(mark₁(X)) -> HEAD₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( HEAD₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

POL( mark₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

HEAD₁(mark₁(X)) -> HEAD₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

HEAD₁(mark₁(X)) -> HEAD₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( HEAD₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( CONS₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( CONS₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)
S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(ok₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.

S₁(mark₁(X)) -> S₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( S₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

POL( mark₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(mark₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( S₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(mark₁(X)) -> FROM₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM₁(mark₁(X)) -> FROM₁(X)

The remaining pairs can at least be oriented weakly.

FROM₁(ok₁(X)) -> FROM₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FROM₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM₁(ok₁(X)) -> FROM₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FROM₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(mark₁(X)) -> SIEVE₁(X)
SIEVE₁(ok₁(X)) -> SIEVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SIEVE₁(mark₁(X)) -> SIEVE₁(X)

The remaining pairs can at least be oriented weakly.

SIEVE₁(ok₁(X)) -> SIEVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( SIEVE₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(ok₁(X)) -> SIEVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SIEVE₁(ok₁(X)) -> SIEVE₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( SIEVE₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( cons₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( tail₁(x₁) ) = x₁

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 2

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( head₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( from₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(divides₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(divides₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( s₁(x₁) ) = x₁

POL( from₁(x₁) ) = x₁

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 2

POL( tail₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(s₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( s₁(x₁) ) = x₁ + 3

POL( from₁(x₁) ) = x₁

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 2

POL( tail₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(from₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( from₁(x₁) ) = x₁ + 3

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 2

POL( tail₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(filter₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(filter₂(X1, X2)) -> PROPER₁(X1)

The remaining pairs can at least be oriented weakly.

PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 2

POL( tail₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(if₃(X1, X2, X3)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( if₃(x₁, ..., x₃) ) = x₁ + x₂ + x₃ + 3

POL( tail₁(x₁) ) = x₁

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(tail₁(X)) -> PROPER₁(X)
PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(tail₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( tail₁(x₁) ) = x₁ + 3

POL( sieve₁(x₁) ) = x₁

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(sieve₁(X)) -> PROPER₁(X)
PROPER₁(head₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(sieve₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(head₁(X)) -> PROPER₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( sieve₁(x₁) ) = x₁ + 3

POL( head₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(head₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(head₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( head₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sieve₁(X)) -> ACTIVE₁(X)
ACTIVE₁(head₁(X)) -> ACTIVE₁(X)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(sieve₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(head₁(X)) -> ACTIVE₁(X)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( sieve₁(x₁) ) = x₁ + 3

POL( head₁(x₁) ) = x₁

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( cons₂(x₁, x₂) ) = x₁

POL( if₃(x₁, ..., x₃) ) = x₁

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(head₁(X)) -> ACTIVE₁(X)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(head₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( head₁(x₁) ) = x₁ + 3

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( cons₂(x₁, x₂) ) = x₁

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( if₃(x₁, ..., x₃) ) = x₁

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(filter₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( filter₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( cons₂(x₁, x₂) ) = x₁

POL( if₃(x₁, ..., x₃) ) = x₁

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( cons₂(x₁, x₂) ) = x₁ + 3

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( if₃(x₁, ..., x₃) ) = x₁

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(divides₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( divides₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( if₃(x₁, ..., x₃) ) = x₁

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(if₃(X1, X2, X3)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( if₃(x₁, ..., x₃) ) = x₁ + 3

POL( from₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( from₁(x₁) ) = x₁ + 3

POL( s₁(x₁) ) = x₁

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( s₁(x₁) ) = x₁ + 3

POL( tail₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(tail₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( tail₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(primes) -> mark₁(sieve₁(from₁(s₁(s₁(0)))))
active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(head₁(cons₂(X, Y))) -> mark₁(X)
active₁(tail₁(cons₂(X, Y))) -> mark₁(Y)
active₁(if₃(true, X, Y)) -> mark₁(X)
active₁(if₃(false, X, Y)) -> mark₁(Y)
active₁(filter₂(s₁(s₁(X)), cons₂(Y, Z))) -> mark₁(if₃(divides₂(s₁(s₁(X)), Y), filter₂(s₁(s₁(X)), Z), cons₂(Y, filter₂(X, sieve₁(Y)))))
active₁(sieve₁(cons₂(X, Y))) -> mark₁(cons₂(X, filter₂(X, sieve₁(Y))))
active₁(sieve₁(X)) -> sieve₁(active₁(X))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(head₁(X)) -> head₁(active₁(X))
active₁(tail₁(X)) -> tail₁(active₁(X))
active₁(if₃(X1, X2, X3)) -> if₃(active₁(X1), X2, X3)
active₁(filter₂(X1, X2)) -> filter₂(active₁(X1), X2)
active₁(filter₂(X1, X2)) -> filter₂(X1, active₁(X2))
active₁(divides₂(X1, X2)) -> divides₂(active₁(X1), X2)
active₁(divides₂(X1, X2)) -> divides₂(X1, active₁(X2))
sieve₁(mark₁(X)) -> mark₁(sieve₁(X))
from₁(mark₁(X)) -> mark₁(from₁(X))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
head₁(mark₁(X)) -> mark₁(head₁(X))
tail₁(mark₁(X)) -> mark₁(tail₁(X))
if₃(mark₁(X1), X2, X3) -> mark₁(if₃(X1, X2, X3))
filter₂(mark₁(X1), X2) -> mark₁(filter₂(X1, X2))
filter₂(X1, mark₁(X2)) -> mark₁(filter₂(X1, X2))
divides₂(mark₁(X1), X2) -> mark₁(divides₂(X1, X2))
divides₂(X1, mark₁(X2)) -> mark₁(divides₂(X1, X2))
proper₁(primes) -> ok₁(primes)
proper₁(sieve₁(X)) -> sieve₁(proper₁(X))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(head₁(X)) -> head₁(proper₁(X))
proper₁(tail₁(X)) -> tail₁(proper₁(X))
proper₁(if₃(X1, X2, X3)) -> if₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(true) -> ok₁(true)
proper₁(false) -> ok₁(false)
proper₁(filter₂(X1, X2)) -> filter₂(proper₁(X1), proper₁(X2))
proper₁(divides₂(X1, X2)) -> divides₂(proper₁(X1), proper₁(X2))
sieve₁(ok₁(X)) -> ok₁(sieve₁(X))
from₁(ok₁(X)) -> ok₁(from₁(X))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
head₁(ok₁(X)) -> ok₁(head₁(X))
tail₁(ok₁(X)) -> ok₁(tail₁(X))
if₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(if₃(X1, X2, X3))
filter₂(ok₁(X1), ok₁(X2)) -> ok₁(filter₂(X1, X2))
divides₂(ok₁(X1), ok₁(X2)) -> ok₁(divides₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.